Approximation schemes for scheduling on parallel machines
نویسندگان
چکیده
منابع مشابه
Approximation Schemes for Scheduling on Parallel Machines
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which the resulting scheduling problems possess a polynomial time approximation scheme. Our result cont...
متن کاملApproximation Schemes for Scheduling on Parallel Machines with GoS Levels∗
We consider the offline scheduling problem of minimizing the makespan on m parallel and identical machines with certain feature. Every job and machine are labeled with the grade of service (GoS) levels, and each job can only be processed by the machine whose GoS level is no more than that of the job. In this paper, we present a polynomial time approximation scheme (PTAS) with running time O(n l...
متن کاملRandomized Approximation Schemes for Scheduling Unrelated Parallel Machines
The problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed, is considered. The standard problem of minimizing the makespan of the schedule (SUM) and the bicriteria problem of scheduling with bounded makespan and cost (SUMC) are addressed, and randomized fully linear time approximation schemes are shown for both of them. While matching the...
متن کاملApproximation Schemes for Scheduling on UniformlyRelated and Identical Parallel
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the machine completion times, including minimizing the l p norm of the vector of completion times. This generalizes and simpliies many previous results in this area.
متن کاملApproximation Results in Parallel Machines Stochastic Scheduling
We consider scheduling a batch of jobs with stochastic processing times on parallel machines. We derive various new formulae for the expected flowtime and weighted flowtime under general scheduling rules. Smith's Rule, which orders job starts by decreasing ratio of weight to expected processing time provides a natural heuristic for this problem. We obtain a bound on the worst case difference be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 1998
ISSN: 1094-6136,1099-1425
DOI: 10.1002/(sici)1099-1425(199806)1:1<55::aid-jos2>3.0.co;2-j